Strongly Regular Graphs Defined by Spreads

نویسنده

  • WILLIAM M. KANTOR
چکیده

Spreads of finite symplectic, orthogonal and unitary vector spaces are used to construct new strongly regular graphs having the same parameters as the perpendicularity graphs of the underlying vector spaces. Some of the graphs are. related to partial geometries, while others produce interesting symmetric designs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spreads in Strongly Regular Graphs

A spread of a strongly regular graph is a partition of the vertex set into cliques that meet Delsarte's bound (also called Hoffman's bound). Such spreads give rise to colorings meeting Hoffman's lower bound for the chromatic number and to certain imprimitive three-class association schemes. These correspondences lead to conditions for existence. Most examples come from spreads and fans in (part...

متن کامل

CERTAIN TYPES OF EDGE m-POLAR FUZZY GRAPHS

In this research paper, we present a novel frame work for handling $m$-polar information by combining the theory of $m-$polar fuzzy  sets with graphs. We introduce certain types of edge regular $m-$polar fuzzy graphs and edge irregular $m-$polar fuzzy graphs. We describe some useful properties of edge regular, strongly edge irregular and strongly edge totally irregular $m-$polar fuzzy graphs. W...

متن کامل

On characterizations of weakly $e$-irresolute functions

The aim of this paper is to introduce and obtain some characterizations of weakly $e$-irresolute functions by means of $e$-open sets defined by Ekici [6]. Also, we look into further properties relationships between weak $e$-irresoluteness and separation axioms and completely $e$-closed graphs.

متن کامل

Cyclotomy and Strongly Regular Graphs

We consider strongly regular graphs defined on a finite field by taking the union of some cyclotomic classes as difference set. Several new examples are found.

متن کامل

Strongly regular and pseudo geometric graphs

Very often, strongly regular graphs appear associated with partial geometries. The point graph of a partial geometry is the graph whose vertices are the points of the geometry and adjacency is defined by collinearity. It is well known that the point graph associated to a partial geometry is a strongly regular graph and, in this case, the strongly regular graph is named geometric. When the param...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1982